Efficient state preparation for a register of quantum bits
نویسندگان
چکیده
We describe a quantum algorithm to prepare an arbitrary pure state of a register of a quantum computer with fidelity arbitrarily close to 1. Our algorithm is based on Grover’s quantum search algorithm. For sequences of states with suitably bounded amplitudes, the algorithm requires resources that are polynomial in the number of qubits. Such sequences of states occur naturally in the problem of encoding a classical probability distribution in a quantum register.
منابع مشابه
State preparation based on Grover’s algorithm in the presence of global information about the state
In a previous paper [1] we described a quantum algorithm to prepare an arbitrary state of a quantum register with arbitrary fidelity. Here we present an alternative algorithm which uses a small number of quantum oracles encoding the most significant bits of the absolute value of the complex amplitudes, and a small number of oracles encoding the most significant bits of the phases. The algorithm...
متن کاملAn Efficient Scheme for PAPR Reduction of OFDM based on Selected Mapping without Side Information
Orthogonal frequency division multiplexing (OFDM) has become a promising method for many wireless communication applications. However, one main drawback of OFDM systems is the high peak-to-average power ratio (PAPR). Selected mapping (SLM) is a well-known technique to decrease the problem of high PAPR in OFDM systems. In this method, transmitter is obliged to send some bits named side informati...
متن کاملQuantum Algorithm Processors to Reveal Hamiltonian Cycles
Professor J. R. Burger Summary – Quantum computer versus quantum algorithm processor in CMOS are compared to find (in parallel) all Hamiltonian cycles in a graph with m edges and n vertices, each represented by k bits. A quantum computer uses quantum states analogous to CMOS registers. With efficient initialization, number of CMOS registers is proportional to (n-1)! Number of qubits in a quantu...
متن کاملMathlab Implementation of Quantum Computation in Searching an Unstructured Database
In the classical model of a computer, the most fundamental building block, the bit, can only exist in one of two distinct states, a 0 or a 1. Computations are carried out by logic gates that act on these bits to produce other bits. Unless there is duplicate (parallel) hardware, only one problem instance (i.e. input data set) can be handled at a time. In this classical computing, increasing the ...
متن کاملNetwork Investigation and Performance Analysis of ZigBee Technology using OPNET
Abstract- Communication has become inevitably part of our day to day activities, in academic, business, banking, and other sectors. It has therefore become so important to implement good and efficient communication system. A reference point according to this research is the wireless sensor networking (WSN) system, and most important thing in communication is to be free from interference, attenu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004